Church-Rosser Groups and Growing Context-Sensitive Groups

نویسندگان

  • Mark Kambites
  • Friedrich Otto
چکیده

A finitely generated group is called a Church-Rosser group (growing contextsensitive group) if it admits a finitely generated presentation for which the word problem is a Church-Rosser (growing context-sensitive) language. Although the ChurchRosser languages are incomparable to the context-free languages under set inclusion, they strictly contain the class of deterministic context-free languages. As each contextfree group language is actually deterministic context-free, it follows that all context-free groups are Church-Rosser groups. As the free abelian group of rank 2 is a non-contextfree Church-Rosser group, this inclusion is proper. On the other hand, we show that there are co-context-free groups that are not growing context-sensitive. Also some closure and non-closure properties are established for the classes of Church-Rosser and growing context-sensitive groups. More generally, we also establish some new characterizations and closure properties for the classes of Church-Rosser and growing context-sensitive

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Church - Rosser languages are the deterministicvariants of the growing context - sensitive languagesGundula

The growing context-sensitive languages have been classiied through the shrinking two-pushdown automaton, the deterministic version of which characterizes the class of generalized Church-Rosser languages (Buntrock and Otto 1995). Exploiting this characterization we prove that this latter class coincides with the class of Church-Rosser languages that was introduced by McNaughton, Narendran, and ...

متن کامل

Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language

In 2002 Jurdziński and Loryś settled a long-standing conjecture that palindromes are not a Church-Rosser language. Their proof required a sophisticated theory about computation graphs of 2-stack automata. We present their proof in terms of 1-tape Turing machines. We also provide an alternative proof of Buntrock and Otto’s result that the set of bitstrings {x : (∀y)x 6= y}, which is context-free...

متن کامل

Parikh-reducing Church-Rosser representations for some classes of regular languages

In this paper the concept of Parikh-reducing Church-Rosser systems is studied. It is shown that for two classes of regular languages there exist such systems which describe the languages using finitely many equivalence classes of the rewriting system. The two classes are: 1.) the class of all regular languages such that the syntactic monoid contains only abelian groups and 2.) the class of all ...

متن کامل

Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions

What is the common link, if there is any, between Church-Rosser systems, prefix codes with bounded synchronization delay, and local Rees extensions? The first obvious answer is that each of these notions relates to topics of interest for WORDS: Church-Rosser systems are certain rewriting systems over words, codes are given by sets of words which form a basis of a free submonoid in the free mono...

متن کامل

Restarting automata , Church - Rosser languages , and con uent

Restarting automata with rewriting, RW-automata for short, were introduced by Jan car, Mrr az, Pll atek, and Vogel (1997). Here we generalize the RW-automata by adding extra tape symbols. In this way we obtain new characterizations for the class CFL of context-free languages and the class CRL of Church-Rosser languages, thus gaining additional information on the exact relationship between these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Automata, Languages and Combinatorics

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2008